One way finite visit automata
نویسندگان
چکیده
منابع مشابه
Path-Bounded One-Way Multihead Finite Automata
For each positive integer r ≥ 1, a nondeterministic machine M is r path-bounded if for any input word x, there are r computation paths of M on x. This paper investigates the accepting powers of pathbounded one-way (simple) multihead nondeterministic finite automata. It is shown that for each k ≥ 2 and r ≥ 1, there is a language accepted by an (r+1) path-bounded one-way nondeterministic k head f...
متن کاملOne-Visit Caterpillar Tree Automata
We study caterpillar tree automata [3] that are restricted to enter any subtree at most one time (or k times). We show that, somewhat surprisingly, the deterministic one-visit automata can already, for instance, evaluate trees where the nodes represent some non-associative operations. We show that there exist regular tree languages that cannot be accepted by a one-visit automaton, thus proving ...
متن کاملRemarks on Sorting and One-Way Multihead Finite Automata
Multihead one-way finite automata (l-MFA) received much attention in studies of devices of low complexity. This is because they work in linear time and because of their simplicity. On the other hand, the class of languages recognized by l-MFA is rather small. Anyway, it contains many languages important from the practical point of view. Despite the simplicity of l-MFA, many problems concerning ...
متن کاملOne-Way Finite Automata with Quantum and Classical States
We introduce 2-way finite automata with quantum and classical states (2qcfa’s). This is a variant on the 2-way quantum finite automata (2qfa) model which may be simpler to implement than unrestricted 2qfa’s; the internal state of a 2qcfa may include a quantum part that may be in a (mixed) quantum state, but the tape head position is required to be classical. We show two languages for which 2qcf...
متن کاملOne-Way Reversible and Quantum Finite Automata with Advice
• This Talk is about • The roles of advice that is given to one-way finite automata. • In particular, for reversible automata and quantum automata. • What is New? • A new characterization of reversible automata using advice. • A new necessary condition for quantum automata with advice. • New separations among advised language families • Why is This Result New? • This extends the existing framew...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1978
ISSN: 0304-3975
DOI: 10.1016/0304-3975(78)90035-x